Coloring t-dimensional m-Boxes
نویسندگان
چکیده
منابع مشابه
Coloring t-dimensional m-Boxes
Abstract. Call the set S1 × · · · × St t–dimensional m–box if |Si| = m for every i = 1, . . . , t. Let Rt(m, r) be the smallest integer R such that for every r–coloring of t–fold cartesian product of [R] one can find a monochromatic t–dimensional m–box. We give a lower and an upper bound for Rt(m, r). We also consider the discrepancy problem connected to this set-system. Among other bounds we p...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملColoring black boxes: visualization of neural network decisions
Neural networks are commonly regarded as black boxes performing incomprehensible functions. For classification problems networks provide maps from high dimensional feature space to K-dimensional image space. Images of training vector are projected on polygon vertices, providing visualization of network function. Such visualization may show the dynamics of learning, allow for comparison of diffe...
متن کاملDistance Graphs and T-Coloring
We discuss relationships among T-colorings of graphs and chromatic numbers, fractional chromatic numbers, and circular chromatic numbers of distance graphs. We first prove that for any finite integral set T that contains 0, the asymptotic T-coloring ratio R(T ) is equal to the fractional chromatic number of the distance graph G(Z, D), where D=T&[0]. This fact is then used to study the distance ...
متن کاملOptimizing Designs Containing Black Boxes*t
We define a notion of equivalence for designs containing black boxes i.e., components whose functionality is not known: these arise naturally in the course of hierarchical design. Using this notion, we describe a sound and complete methodology for optimizing such designs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00180-1